Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models

摘要

Optimal delay-throughput trade-offs for two-dimensional i.i.d mobility modelshave been established in [23], where we showed that the optimal trade-offs canbe achieved using rate-less codes when the required delay guarantees aresufficient large. In this paper, we extend the results to other mobility modelsincluding two-dimensional hybrid random walk model, one-dimensional i.i.d.mobility model and one-dimensional hybrid random walk model. We consider bothfast mobiles and slow mobiles, and establish the optimal delay-throughputtrade-offs under some conditions. Joint coding-scheduling algorithms are alsoproposed to achieve the optimal trade-offs.